OMASS: One Memory Access Set Separation

EMOMA: Exact Match in One Memory Access

An important function in modern routers and switches is to perform a lookup for a key. Hash-based methods, and in particular cuckoo hash tables, are popular for such lookup operations, but for large structures stored in off-chip memory, such methods have the downside that they may require more than one off-chip memory access to perform the key lookup. Although the number of off-chip memory acce...

Tree automata with one memory set constraints and cryptographic protocols

One Microphone Source Separation

Source separation, or computational auditory scene analysis, attempts to extract individual acoustic objects from input which contains a mixture of sounds from different sources, altered by the acoustic environment. Unmixing algorithms such as ICA and its extensions recover sources by reweighting multiple observation sequences, and thus cannot operate when only a single observation signal is av...

On the Pi-one-one Separation Principle

We study the proof theoretic strength of the Π1-separation axiom scheme. We show that Π1-separation lies strictly in between the ∆ 1 1-comprehension and Σ 1 1choice axiom schemes over RCA0.

An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons

We consider the problem of separating a collection of isothetic polygons in the plane by translating one polygon at a time to innnity. The directions of translation are the four isothetic (parallel to the axes) directions, but a particular polygon can be translated only in one of these four directions. Our algorithm detects whether a scene is separable in this sense and computes a translational...